Recursive layout generation
نویسندگان
چکیده
We present a recursive method for generating layout for VLSI chips which combines the flexibility of gate array and standard cell layout with the control and density of custom layout. The method allows seamless integration of hand-drawn and synthesized layout, so that hand layout need only be used where the increase in density is justified. Layout is generated automatically with predictable results; small changes in the source result in small changes of the overall layout. The system is versatile enough to build dense VLSI microprocessor chips automatically. d i g i t a l Western Research Laboratory 250 University Avenue Palo Alto, California 94301 USA
منابع مشابه
Parallel and fully recursive multifrontal sparse Cholesky
We describe the design, implementation, and performance of a new parallel sparse Cholesky factorization code. The code uses a multifrontal factorization strategy. Operations on small dense submatrices are performed using new dense matrix subroutines that are part of the code, although the code can also use the blas and lapack. The new code is recursive at both the sparse and the dense levels, i...
متن کاملA Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach
This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...
متن کاملA Methodology for Generating Application Specific Tree Multipliers
Low latency, application, specific multipliers are required fo r m,any DSP algorithms. Tree multipliers are an obvious answer to this requirement. However, tree architectures have not been considered for automatic multiplier generation because they have been conszdered to be irregular. I n this paper, a recursive methodology f o r generating n-2 compressors (for n in the range 3 5 n 5 64) using...
متن کاملMulti-stage Object Detection with Group Recursive Learning
Most of existing detection pipelines treat object proposals independently and predict bounding box locations and classification scores over them separately. However, the important semantic and spatial layout correlations among proposals are often ignored, which are actually useful for more accurate object detection. In this work, we propose a new EM-like group recursive learning approach to ite...
متن کاملCompression in Data Caches with Data Layout Transformation for Recursive Data Structures
We introduce a software/hardware scheme called the Field Array Compression Technique (FACT) which reduces cache misses due to recursive data structures. Using a data layout transformation, data with temporal affinity is gathered in contiguous memory, where the recursive pointers and integer fields are compressed. As a result, one cache-block can capture a greater amount of data with temporal af...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995